1. Class No.02 Data Structures http://ecomputernotes.com
2.
3.
4.
5.
6.
7.
8.
9.
10. Implementing Lists find(X): traverse the array until X is located. int find(int X) { int j; for(j=1; j < size+1; j++ ) if( A[j] == X ) break; if( j < size+1 ) { // found X current = j; // current points to where X found return 1; // 1 for true } return 0; // 0 (false) indicates not found } http://ecomputernotes.com